Limits on the power of concurrent-write parallel machines
نویسندگان
چکیده
منابع مشابه
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution
The ROBUST PRAM is a concurrent-read concurrent-write (CRCW) parallel random access machine in which any value might appear in a memory cell as a result of a write connict. This paper addresses the question of whether a PRAM with such a weak form of write connict resolution can compute functions faster than the concurrent-read exclusive-write (CREW) PRAM. We prove a lower bound on the time requ...
متن کاملParallel Merge Sort on Concurrent-Read Owner-Write PRAM
This paper discusses a variant of the CREW PRAM model introduced by Dymond and Ruzzo called CROW (Concurrent Read Owner Write) PRAM. in which each global memory location may only be written by its assigned owner processor. We show that CROW PRAMs can sort in O(log n) parallel time using O(n log n) processors.
متن کاملPower of Preemption on Uniform Parallel Machines
For a scheduling problem on parallel machines, the power of preemption is defined as the ratio of the makespan of an optimal non-preemptive schedule over the makespan of an optimal preemptive schedule. For m uniform parallel machines, we give the necessary and sufficient conditions under which the global bound of 2 − 1/m is tight. If the makespan of the optimal preemptive schedule is defined by...
متن کاملanalysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولOn multiply-exponential write-once Turing machines
In this work we analyze the multiply-exponential complexity classes for writeonce Turing machines, i.e. machines that can write to a given tape cell at most once. We show that k–DExpWOSpace = k–DExpWOTime = k–ExpTime and the nondeterministic counterpart. For alternating machines we show that k–AExpWOTime = k–AExpTime = k-1–ExpSpace.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1988
ISSN: 0890-5401
DOI: 10.1016/0890-5401(88)90040-5